Vicious Walkers and Hook Young Tableaux

نویسندگان

  • Kazuhiro Hikami
  • Takashi Imamura
چکیده

We consider a generalization of the vicious walker model. Using a bijection map between the path configuration of the non-intersecting random walkers and the hook Young diagram, we compute the probability concerning the number of walker’s movements. Applying the saddle point method, we reveal that the scaling limit gives the Tracy–Widom distribution, which is same with the limit distribution of the largest eigenvalues of the Gaussian unitary ensemble. PACS: † [email protected][email protected] 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vicious Walkers, Friendly Walkers and Young Tableaux Ii: with a Wall

We derive new results for the number of star and watermelon configurations of vicious walkers in the presence of an impenetrable wall by showing that these follow from standard results in the theory of Young tableaux, and combinatorial descriptions of symmetric functions. For the problem of n-friendly walkers, we derive exact asymptotics for the number of stars and watermelons both in the absen...

متن کامل

Vicious walkers and Young tableaux I: without walls

We rederive previously known results for the number of star and watermelon configurations by showing that these follow immediately from standard results in the theory of Young tableaux and integer partitions. In this way we provide a proof of a result, previously only conjectured, for the total number of stars.

متن کامل

A Reflection Principle for Three Vicious Walkers

We establish a reflection principle for three lattice walkers and use this principle to reduce the enumeration of the configurations of three vicious walkers to that of configurations of two vicious walkers. In the combinatorial treatment of two vicious walkers, we make connections to two-chain watermelons and to the classical ballot problem. Precisely, the reflection principle leads to a bijec...

متن کامل

Vicious Walkers, Friendly Walkers, and Young Tableaux. III. Between Two Walls

1 Institut für Mathematik, Universität Wien, Strudlhofgasse 4, A-1090 Vienna, Austria. 2 Department of Mathematics and Statistics, The University of Melbourne, Victoria 3010, Australia; e-mail: [email protected] 3 LaBRI, Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France. 4 Present address: Institut Gerard Desargues, Université Claude Bernard Lyon-I, Bâtiment B...

متن کامل

Random vicious walks and random matrices

Lock step walker model is a one-dimensional integer lattice walker model in discrete time. Suppose that initially there are infinitely many walkers on the non-negative even integer sites. At each tick of time, each walker moves either to its left or to its right with equal probability. The only constraint is that no two walkers can occupy the same site at the same time. It is proved that in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009